Multi–dimensional firefly algorithm based on local search for solving unit commitment problem

The Unit Commitment problem (UC) is a complex mixed-integer nonlinear programming problem, so the main challenge faced by many researchers obtaining optimal solution. Therefore, this dissertation proposes new methodology combining multi-dimensional firefly algorithm with local search called LS-MFA and utilizes it to solve UC problem. In addition, adaptive adjustment, tolerance mechanism, pit-jumping random strategy help improve path simplify redundant solutions. experimental work of unit commitment output 10–100 machines in 24-hour period carried out paper. And shows that compared previous artificial intelligence algorithms, total cost obtained less results are excellent.